Pseudo‐3D RSSI‐based WSN localization algorithm using linear regression

Receiver Strength Signal Indication based Wireless Sensor Networks offer a cheap solution for location‐aware applications. For a final breakthrough these systems need fast deployment and easy auto‐configuration. In this study, we use the real‐life iMinds test bed to expand a two‐dimensional localization algorithm to the pseudo third dimension with very low additional computational time. Our experiments show that this fast three‐dimensional algorithm has no outliers and avoids manual calibration. Our algorithm has lower position errors than a maximum likelihood algorithm with a mean square error cost function. Furthermore, with non‐parametric statistical tests, we show that our previously designed two‐dimensional preprocessing performs equally well in pseudo‐three dimensions: the preprocessing reduces the position error in a statistically significant way.Copyright © 2013 John Wiley & Sons, Ltd.     

Coordination mechanism based on mobile actuator design for wireless sensor and actuator networks

Wireless sensor and actuator networks combine a large number of sensors and a lower number of actuators that are connected with wireless medium, providing distributed sensing and executing appropriate tasks in a special region of interest. To accomplish effective sensing and acting tasks, efficient coordination mechanism among the nodes is required. As an attempt in this direction, this paper develops a collaborative control and estimation mechanism, which addresses the nodes coordination in a distributed manner. First, we propose a regional controllability‐based virtual force algorithm as an actuator deployment strategy to enhance area coverage after an initial random placement of actuators. During this process, a dynamic coordination mechanism is adopted to control nodes. This mechanism incorporates two components, namely, proportional‐integral‐derivative neural network and recursive least squares‐based Kalman filter algorithms. Taking advantage of feedback control and online learning technology, the proposed coordination mechanism schedules the corresponding nodes on the basis of the characteristics of current events, utilizes proportional‐integral‐derivative neural network controller inside each actuator to improve system transient and steady‐state responses, and deals with system state/parameter estimation problems according to the recursive least squares‐based Kalman filter algorithm, so as to achieve better control accuracy. Simulations demonstrate the effectiveness of our proposed methods. Copyright © 2013 John Wiley & Sons, Ltd.     

Performance analysis of multiple‐input multiple‐output relay networks based impulse radio ultra‐wideband

In this paper, we study the performance of time hopping pulse position modulation for impulse radio ultra‐wideband. We consider relay network applying decode‐and‐forward protocol. The channels between nodes adopt the IEEE 802.15.4a norms. The bit error rate performance is analyzed considering the effect of interference. Our results show significant improvement due to the diversity gain provided by the relay nodes. However, the performance is limited when multiple access interference (MAI) is present. To combat the MAI effect and further improve the detection reliability, we propose to use antenna selection at the relay. The relay receiver is assumed to be equipped with multiple antennas, and only the best antenna is selected. This is shown to improve the performance in the presence of MAI and improve the diversity gain.Copyright © 2013 John Wiley & Sons, Ltd.     

An efficient HARQ scheme for applications in multicast communication systems

This paper deals with the performance evaluation and optimization of an efficient hybrid automatic repeat request (HARQ) scheme suitable for applications delivered over lossy multicast communication channels. In particular, different from previously investigated strategies, this paper proposes a modified HARQ scheme based on the symbol combining principle (MHARQ‐SC) where multiple copies of a same packet are consecutively transmitted at each transmission opportunity. By considering as the performance metrics, the mean packet delivery delay, and the energy consumption per information packet, this paper presents suitable performance evaluation and optimization strategies tailored for multicast communications. For the sake of comparisons, it has been also analyzed, under the same operational conditions, the performance of different HARQ schemes optimized for multicast communications. Numerical results have been provided to validate the proposed performance evaluation and optimization approaches in the case of the MHARQ‐SC scheme. An important result devised here is that the reported analytical results clearly highlight the performance gain of the proposed strategy in comparison with all the other considered alternatives. Copyright © 2013 John Wiley & Sons, Ltd.     

Adaptive B‐spline neural network‐based vector control for a grid side converter in wind turbine‐DFIG systems

This paper presents a novel control system design for the grid‐side converter of doubly fed induction generator wind power generation systems. The control method proposed in this work is a vector control based on adaptive B‐spline neural network by using a simple fixed‐gain stabilizing control topology. The adaptive control is designed both for inner current loops and an outer DC‐link voltage loop of the grid side converter control system. To guarantee the control stability, the weights updating rule for the B‐spline neural network is synthesized by utilizing Lyapunov's direct method. To verify the effectiveness of the proposed control system, extensive simulations are performed using MATLAB/Simulink. Based on the simulation results, it is concluded that the proposed controller has improved performance compared to an optimum proportional integral control system. It is also relatively robust against external disturbances and variations of the control parameters. © 2015 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

A venues‐aware message routing scheme for delay‐tolerant networks

With their proliferation and increasing capabilities, mobile devices with local wireless interfaces can be organized into delay‐tolerant networks (DTNs) that exploit communication opportunities arising out of the movement of their users. As the mobile devices are usually carried by people, these DTNs can also be viewed as social networks. Unfortunately, most existing routing algorithms for DTNs rely on relatively simple mobility models that rarely consider these social network characteristics, and therefore, the mobility models in these algorithms cannot accurately describe users’ real mobility traces. In this paper, we propose two predict and spread (PreS) message routing algorithms for DTNs. We employ an adapted Markov chain to model a node's mobility pattern and capture its social characteristics. A comparison with state‐of‐the‐art algorithms demonstrates that PreS can yield better performance in terms of delivery ratio and delivery latency, and it can provide a comparable performance with the epidemic routing algorithm with lower resource consumption. Copyright © 2013 John Wiley & Sons, Ltd.     

Non‐cooperative game‐based packet ferry forwarding for sparse mobile wireless networks

In sparse mobile wireless networks, normally, the mobile nodes are carried by people, and the moving activity of nodes always happens in a specific area, which corresponds to some specific community. Between the isolated communities, there is no stable communication link. Therefore, it is difficult to ensure the effective packet transmission among communities, which leads to the higher packet delivery delay and lower successful delivery ratio. Recently, an additional ferry node was introduced to forward packets between the isolated communities. However, most of the existing algorithms are working on how to control the trajectory of only one ferry work in the network. In this paper, we consider multiple ferries working in the network scenario and put our main focus on the optimal packet selection strategy, under the condition of mutual influence between the ferries and the buffer limitation. We introduce a non‐cooperative Bayesian game to achieve the optimal packet selection strategy. By maximizing the individual income of a ferry, we optimize the network performance on packet delivery delay and successful delivery ratio. Simulation results show that our proposed packet selection strategy improves the network performance on packet delivery delay and successful delivery ratio. Copyright © 2013 John Wiley & Sons, Ltd.     

A channel reservation and preemption model using overlapping regions in sector‐based cellular networks

This paper presents a channel reservation and preemption (CRP) model using overlapping regions in a cellular network with multiple sectors. To fully exploit and reuse the frequencies, directional antennas are installed on base stations (BSs) to divide the coverage into a number of equal‐sized sectors. When traffic is unevenly distributed across the sectors in a BS, channel utilization in every sector may become very different; low‐traffic sectors may be underutilized while high‐traffic sectors may be overutilized. A CRP scheme is thus proposed to more efficiently utilize free channels among sectors. CRP aims at reducing the dropping probabilities of handoff calls. Specifically, when free channels in a sector are not available, a handoff call, instead of being dropped, is allowed to preempt an ongoing call residing in the overlapping region of two adjacent sectors or two neighbor cells. Under CRP, the preempted ongoing call will not be disconnected, because it can switch over its service to the BS of a neighbor cell or to another directional antenna of an adjacent sector. For the purpose of evaluation, we build an analytical model for the proposed CRP using six‐tuple Markov chains. Analytical results show that the proposed CRP can significantly reduce the dropping probabilities of inter‐sector handoff calls, particularly when traffic between two sectors is not evenly distributed. Copyright © 2013 John Wiley & Sons, Ltd.     

An energy‐efficient utility‐based distributed data routing scheme for heterogenous sensor networks

A utility‐based distributed data routing algorithm is proposed and evaluated for heterogeneous wireless sensor networks. It is energy efficient and is based on a game‐theoretic heuristic load‐balancing approach. It runs on a hierarchical graph arranged as a tree with parents and children. Sensor nodes are considered heterogeneous in terms of their generated traffic, residual energy and data transmission rate and the bandwidth they provide to their children for communication. The proposed method generates a data routing tree in which child nodes are joined to parent nodes in an energy‐efficient way. The principles of the Stackelberg game, in which parents as leaders and children as followers, are used to support the distributive nature of sensor networks. In this context, parents behave cooperatively and help other parents to adjust their loads, while children act selfishly. Simulation results indicate the proposed method can produce on average more load‐balanced trees, resulting in over 30% longer network lifetime compared with the cumulative algorithm proposed in the literature. Copyright © 2014 John Wiley & Sons, Ltd.     

An altruistic cross‐layer recovering mechanism for ad hoc wireless networks

Video streaming services have restrictive delay and bandwidth constraints. Ad hoc networks represent a hostile environment for this kind of real‐time data transmission. Emerging mesh networks, where a backbone provides more topological stability, do not even assure a high quality of experience. In such scenario, mobility of terminal nodes causes link breakages until a new route is calculated. In the meanwhile, lost packets cause annoying video interruptions to the receiver. This paper proposes a new mechanism of recovering lost packets by means of caching overheard packets in neighbor nodes and retransmit them to destination. Moreover, an optimization is shown, which involves a video‐aware cache in order to recover full frames and prioritize more significant frames. Results show the improvement in reception, increasing the throughput as well as video quality, whereas larger video interruptions are considerably reduced. Copyright © 2014 John Wiley & Sons, Ltd.